Improving k-buffer Methods via Occupancy Maps
نویسندگان
چکیده
In this work, we investigate an efficient approach to treat fragment racing when computing k-nearest fragments. Based on the observation that knowing the depth position of the k-th fragment we can optimally find the k-closest fragments, we introduce a novel fragment culling component by employing occupancy maps. Without any softwareredesign, the proposed scheme can easily be attached at any k-buffer pipeline to efficiently perform early-z culling. Finally, we report on the efficiency, memory space, and robustness of the upgraded k-buffer alternatives providing comprehensive comparison results.
منابع مشابه
Buffer Occupancy and Delivery Reliability Tradeoffs for Epidemic Routing
To achieve end-to-end delivery in intermittently connected networks, epidemic routing is proposed for data delivery at the price of excessive buffer occupancy due to its store-and-forward nature. The ultimate goal of epidemic routing protocol design is to reduce system resource usage (e.g., buffer occupancy) while simultaneously providing data delivery with statistical guarantee. Therefore the ...
متن کاملAn enhanced occupancy map for exploration via pose separation
We develop a new occupancy map that respects the role of the sensor measurement bearing and how it relates to the resolution of the existing occupancy map. We borrow an idea from Konolige for recording and tracking, in an occupancy-like map, the bearing at which sensor readings originate with respect to a given cell. Our specific contribution is in the way we process the sensor pose information...
متن کاملBuffer Occupancy and Delay Asymptotics in Multi-buffered Systems with Generalized Processor Sharing Handling a Large Number of Independent Traffic Streams∗
In this paper we study a multi-buffer Generalized Processor Sharing (GPS ) scheduled system in the so-called many sources regime resulting from multiplexing a large number of independent stationary input streams in each of the buffers. The notion of largeness is via the notion of scaling by which the buffer occupancy and the server speed are scaled in proportion to the number of inputs in such ...
متن کاملRobust Matching of Occupancy Maps for Odometry in Autonomous Vehicles
In this paper we propose a novel real-time method for SLAM in autonomous vehicles. The environment is mapped using a probabilistic occupancy map model and EGO motion is estimated within the same environment by using a feedback loop. Thus, we simplify the pose estimation from 6 to 3 degrees of freedom which greatly impacts the robustness and accuracy of the system. Input data is provided via a r...
متن کاملWork Group 1 ( For Technologies ) TITLE : A Fast and Efficient Buffer Sharing Scheme for an Input Buffer ATM Switch
In this paper a fair and fast buffer sharing scheme based on the round robin cell distribution mechanism for an input buffer ATM switch is proposed. This buffer sharing scheme improves the performance of the input buffer ATM switch in terms of the cell loss ratio and the CDV by equalizing the occupancy of input buffers. In order to make the equalizing and buffer sharing operation fast and simpl...
متن کامل